Proof Net Semantics of Proof Search Computation
نویسندگان
چکیده
We present a sound and complete compositional semantics, structured around certain abstractions of proof nets, for proof-search computation in a linear logic-based language. The model captures the interaction of agents in terms of the actions they engage into and of the dynamic creation of names. The model is adequate for reasoning about a notion of operational equivalence. We will also suggest how a partial order semantics can be derived from the present approach.
منابع مشابه
Flow Analysis: Games and Nets
This paper presents a graph-based formulation of controlflow analysis using results from game semantics and proof-nets. Controlflow analysis aims to give a conservative prediction of the flow of control in a program. In our analysis, terms are represented by proof-nets and control-flow analysis amounts to the analysis of computation paths in the proof-net. We focus on a context free analysis kn...
متن کاملAn Adjunction-Theoretic Foundation for Proof Search in Intuitionistic First-Order Categorical Logic Programming
In this thesis we compose a proof-theoretic approach to logic programming with a category-theoretic approach to proof theory. This allows us to present the computation mechanisms of several systems of logic programming as proof search strategies within an intuitionistic first-order sequent calculus with logic variables and to analyze aspects of their behavior algebraically. Beginning from the b...
متن کاملProvability in Intuitionistic Linear Logic from a New Interpretation on Petri nets
Linear logic is a logic of actions which seems well suited to various computer science applications. From its intrinsic ability to reeect computational resources, it is possible to reene diierent programming paradigms like formulae-as-types (proofs-as-programs) or formulae-as-states (proofs-as-computations) with a ner control on resource management. In the latter case, the correspondence betwee...
متن کاملA Proof Theoretical Approach to Communication
The paper investigates a concurrent computation model, chi calculus, in which communications resemble cut eliminations for classical proofs. The algebraic properties of the model are studied. Its relationship to sequential computation is illustrated by showing that it incorporates the operational semantics of the call-by-name lambda calculus. Practically the model has pi calculus as a submodel....
متن کاملA Lattice-Based Approach to Computing Warranted Beliefs in Skeptical Argumentation Frameworks
Abstract argumentation frameworks have played a major role as a way of understanding argumentbased inference, resulting in different argumentbased semantics. In order to make such semantics computationally attractive, suitable proof procedures are required, in which a search space of arguments is examined to find out which arguments are warranted or ultimately acceptable. This paper introduces ...
متن کامل